Hadwiger Conjecture for Inflations of the Petersen Graph
نویسندگان
چکیده
LATEX by Adam Jobson For a family of graphs F closed under subgraphs, and a graph G from F , define a game (G,F) played by Builder and Painter. The game begins with Builder presenting an edge and Painter coloring the edge red or blue. On each turn thereafter, Builder adds another edge to the red-blue colored graph present (adding vertices if needed), so that the new graph, viewed uncolored, is a member of F . Painter must then color the new edge red or blue. Builder wins if a monochromatic version of G appears as a subgraph.
منابع مشابه
A note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملA classification of cubic bicirculants
The well-known Petersen G(5, 2) admits a semi-regular automorphism α acting on the vertex set with two orbits of equal size. This makes it a bicirculant. It is shown that trivalent bicirculants fall into four classes. Some basic properties of trivalent bicirculants are explored and the connection to combinatorial and geometric configurations are studied. Some analogues of the polycirculant conj...
متن کامل1 1 O ct 2 01 1 Disproof of the List Hadwiger Conjecture
The List Hadwiger Conjecture asserts that every Kt-minor-free graph is t-choosable. We disprove this conjecture by constructing a K3t+2-minor-free graph that is not 4tchoosable for every integer t ≥ 1.
متن کاملDisproof of the List Hadwiger Conjecture
The List Hadwiger Conjecture asserts that every Kt-minor-free graph is tchoosable. We disprove this conjecture by constructing a K3t+2-minor-free graph that is not 4t-choosable for every integer t ≥ 1.
متن کامل